Overlapping Domain Decomposition Methods for Linear Inverse Problems
نویسندگان
چکیده
We shall derive and propose several efficient overlapping domain decomposition methods for solving some typical linear inverse problems, including the identification of the flux, the source strength and the initial temperature in second order elliptic and parabolic systems. The methods are iterative, and computationally very efficient: only local forward and adjoint problems need to be solved in each subdomain, and the local minimizations have explicit solutions. Numerical experiments are provided to demonstrate the robustness and efficiency of the methods: the algorithms converge globally, even with rather poor initial guesses; and their convergences do not deteriorate or deteriorate only slightly when the meshes are refined.
منابع مشابه
A Parallel Overlapping Time-Domain Decomposition Method for ODEs
We introduce an overlapping time-domain decomposition for linear initial-value 7 problems which gives rise to an efficient solution method for parallel computers without 8 resorting to the frequency domain. This parallel method exploits the fact that homogeneous 9 initial-value problems can be integrated much faster than inhomogeneous problems by using 10 an efficient Arnoldi approximation for ...
متن کاملDomain Decomposition Preconditioners for Linear–quadratic Elliptic Optimal Control Problems
We develop and analyze a class of overlapping domain decomposition (DD) preconditioners for linear-quadratic elliptic optimal control problems. Our preconditioners utilize the structure of the optimal control problems. Their execution requires the parallel solution of subdomain linear-quadratic elliptic optimal control problems, which are essentially smaller subdomain copies of the original pro...
متن کاملNon-overlapping Domain Decomposition Methods in Structural Mechanics
The modern design of industrial structures leads to very complex simulations characterized by nonlinearities, high heterogeneities, tortuous geometries... Whatever the modelization may be, such an analysis leads to the solution to a family of large ill-conditioned linear systems. In this paper we study strategies to efficiently solve to linear system based on non-overlapping domain decompositio...
متن کاملOn the Innuence of the Partitioning Schemes on the Eeciency of Overlapping Domain Decomposition Methods on the Innuence of the Partitioning Schemes on the Eeciency of Overlapping Domain Decomposition Methods
One level overlapping Schwarz domain decomposition preconditioners can be viewed as a generalization of block Jacobi preconditioning. The eeect of the number of blocks and the amount of overlapping between blocks on the convergence rate is well understood. This paper considers the related issue of the eeect of the scheme used to partition the matrix into blocks on the convergence rate of the pr...
متن کاملRestricted overlapping balancing domain decomposition methods and restricted coarse problems for the Helmholtz problem
Overlapping balancing domain decomposition methods and their combination with restricted additive Schwarz methods are proposed for the Helmholtz equation. These new methods also extend previous work on non-overlapping balancing domain decomposition methods toward simplifying their coarse problems and local solvers. They also extend restricted Schwarz methods, originally designed to overlapping ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014